Convergence Rate for a Gauss Collocation Method Applied to Constrained Optimal Control
نویسندگان
چکیده
Abstract. A local convergence rate is established for a Gauss orthogonal collocation method applied to optimal control problems with control constraints. If the Hamiltonian possesses a strong convexity property, then the theory yields convergence for problems whose optimal state and costate possess two square integrable derivatives. The convergence theory is based on a stability result for the sup-norm change in the solution of a variational inequality relative to a 2-norm perturbation, and on a Sobolev space bound for the error in interpolation at the Gauss quadrature points and the additional point −1. The tightness of the convergence theory is examined using a numerical example.
منابع مشابه
Convergence Rate for a Gauss Collocation Method Applied to Unconstrained Optimal Control
Alocal convergence rate is established for an orthogonal collocationmethod based on Gauss quadrature applied to an unconstrained optimal control problem. If the continuous problem has a smooth solution and the Hamiltonian satisfies a strong convexity condition, then the discrete problem possesses a local minimizer in a neighborhood of the continuous solution, and as the number of collocation po...
متن کاملA New Modification of Legendre-Gauss Collocation Method for Solving a Class of Fractional Optimal Control Problems
In this paper, the optimal conditions for fractional optimal control problems (FOCPs) were derived in which the fractional differential operators defined in terms of Caputo sense and reduces this problem to a system of fractional differential equations (FDEs) that is called twopoint boundary value (TPBV) problem. An approximate solution of this problem is constructed by using the Legendre-Gauss...
متن کاملConvergence Rate for a Radau Collocation Method Applied to Unconstrained Optimal Control
Abstract. A local convergence rate is established for an orthogonal collocation method based on Radau quadrature applied to an unconstrained optimal control problem. If the continuous problem has a sufficiently smooth solution and the Hamiltonian satisfies a strong convexity condition, then the discrete problem possesses a local minimizer in a neighborhood of the continuous solution, and as the...
متن کاملConvergence Rate for a Radau Hp Collocation Method Applied to Constrained Optimal Control ∗
Abstract. For control problems with control constraints, a local convergence rate is established for an hp-method based on collocation at the Radau quadrature points in each mesh interval of the discretization. If the continuous problem has a sufficiently smooth solution and the Hamiltonian satisfies a strong convexity condition, then the discrete problem possesses a local minimizer in a neighb...
متن کاملAdaptive mesh refinement method for optimal control using nonsmoothness detection and mesh size reduction
An adaptive mesh refinement method for solving optimal control problems is developed. The method employs orthogonal collocation at Legendre-Gauss-Radau points, and adjusts both the mesh size and the degree of the approximating polynomials in the refinement process. A previously derived convergence rate is used to guide the refinement process. The method brackets discontinuities and improves sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017